Cooley-Tukey FFT on the Connection Machine
نویسندگان
چکیده
منابع مشابه
Cooley - Tukey FFT on the Connection
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make e ective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...
متن کاملCooley - Tukey FFT on the Connection MachineS
We describe an implementation of the Cooley Tukey complex-to-complex FFT on the Connection Machine. The implementation is designed to make eeective use of the communications bandwidth of the architecture, its memory bandwidth, and storage with precomputed twiddle factors. The peak data motion rate that is achieved for the interprocessor communication stages is in excess of 7 Gbytes/s for a Conn...
متن کاملThe Cooley–Tukey FFT and Group Theory
In 1965 J. Cooley and J. Tukey published an article detailing an efficient algorithm to compute the Discrete Fourier Transform, necessary for processing the newly available reams of digital time series produced by recently invented analog-to-digital converters. Since then, the Cooley– Tukey Fast Fourier Transform and its variants has been a staple of digital signal processing. Among the many ca...
متن کاملCooley-Tukey FFT like algorithms for the DCT
The Cooley-Tukey FFT algorithm decomposes a discrete Fourier transform (DFT) of size n = km into smaller DFTs of size k and m. In this paper we present a theorem that decomposes a polynomial transform into smaller polynomial transforms, and show that the FFT is obtained as a special case. Then we use this theorem to derive a new class of recursive algorithms for the discrete cosine transforms (...
متن کاملAn Investigation of Cooley-Tukey Decompositions for the FFT
The goals of the research discussed in this report are to determine the impact of di erent Cooley-Tukey decompositions on the performance of computer programs that compute the FFT, evaluate di erent methods for nding the most e cient decompositions, and determine the characteristics of the most e cient decompositions. Experiments are conducted using three di erent FFT programs and three dynamic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 1992
ISSN: 0167-8191
DOI: 10.1016/0167-8191(92)90066-g